Identifying Hierarchical Structure in Sequences: A linear-time algorithm
نویسندگان
چکیده
منابع مشابه
Identifying Hierarchical Structure in Sequences: A linear-time algorithm
SEQUITUR is an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing repeated phrases with a grammatical rule that generates the phrase, and continuing this process recursively. The result is a hierarchical representation of the original sequence, which offers insights into its lexical structure. The algorithm is driven by two constraints that reduce th...
متن کاملIdentifying the time of a step change in AR(1) auto-correlated simple linear profiles
Assuming a first-order auto-regressive model for the auto-correlation structure between observations, in this paper, a transformation method is first employed to eliminate the effect of auto-correlation. Then, a maximum likelihood estimator (MLE) of a step change in the parameters of the transformed model is derived and three separate EWMA control charts are used to monitor the parameters of th...
متن کاملIdentifying Splice-Junction Sequences by Hierarchical Multiclassifier
Splice sites are locations in DNA which separate protein-coding regions (exons) from noncoding regions (introns). Recently, several works have approached the splice-junction problem by applying methods from the field of machine learning techniques. In this work, we propose a hierarchical multiclassifier (HM) architecture, whose results show a drastically error reduction with respect to the perf...
متن کاملFast Hierarchical Gram Algorithm toward Time A
We present an algorithm for hierarchical grammar optimization achieving time and space efficiency in Automatic Speech Recognition (ASR). The algorithm includes two parts: a selective grammar expansion algorithm and a graph reduction algorithm. The latter algorithm includes a node-merging procedure and an arc-sharing procedure. The algorithm is general so as to handle all types of grammar used i...
متن کاملLinear-time inference in Hierarchical HMMs
The hierarchical hidden Markov model (HHMM) is a generalization of the hidden Markov model (HMM) that models sequences with structure at many length/time scales [FST98]. Unfortunately, the original inference algorithm is rather complicated, and takes time, where is the length of the sequence, making it impractical for many domains. In this paper, we show how HHMMs are a special kind of dynamic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1997
ISSN: 1076-9757
DOI: 10.1613/jair.374